skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 3

Search for: All records

Creators/Authors contains: "Pitassi, Toniann"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; (, Innovations in Theoretical Computer Science (ITCS 2025))
    Free, publicly-accessible full text available June 1, 2026
  2. ; (, IEEE)
    Full Text Available 
  3. ; (, IEEE)
    Accepted Manuscript Full Text Available
  4. ; ; ; ; (, Computational complexity)
    Accepted Manuscript Full Text Available
  5. ; ; ; ; ; (, ICALP)
    Accepted Manuscript Full Text Available
  6. ; ; ; ; (, ITCS)
    Accepted Manuscript Full Text Available
  7. ; ; ; (, ACM)
    Accepted Manuscript Full Text Available
  8. ; ; (, Proceedings IEEE Conference on Computational Complexity)
    Accepted Manuscript Full Text Available
  9. ; ; ; (, Proceedings IEEE Conference on Computational Complexity)
    Accepted Manuscript Full Text Available
  10. ; ; (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Ta-Shma, Amnon (Ed.)
    For every prime p > 0, every n > 0 and κ = O(log n), we show the existence of an unsatisfiable system of polynomial equations over O(n log n) variables of degree O(log n) such that any Polynomial Calculus refutation over 𝔽_p with M extension variables, each depending on at most κ original variables requires size exp(Ω(n²)/10^κ(M + n log n)) 
    more » « less
    Full Text Available